Refining Triangle Meshes by Non-linear Subdivision

نویسندگان

  • Stefan Karbacher
  • Stephan Seeger
  • Gerd Häusler
چکیده

Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., B-splines are smooth curves or surfaces that can be constructed by infinite subdivision of a polyline or polygon mesh of control points. New vertices are computed by linear combinations of the initial control points. We present a new non-linear subdivision scheme for the refinement of triangle meshes that generates smooth surfaces with minimum curvature variations. It is based on a combination of edge splitting operations and interpolation by blending circular arcs. In contrast to most conventional methods, the final mesh density may be locally adapted to the structure of the mesh. As an application we demonstrate how this subdivision scheme can be used to reconstruct missing range data of incompletely digitized 3-D objects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental subdivision for triangle meshes

We introduce incremental subdivision as a new adaptive subdivision method for triangle meshes. While regular (global) subdivisions produce a smooth surface from a given polygon mesh by refining all of its faces, adaptive subdivision produces a surface by refining only some selected areas of the mesh. Consequently, the selected area becomes fine and high resolution while the rest of mesh is coar...

متن کامل

A Non-Linear Subdivision Scheme for Triangle Meshes

Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., B-splines are smooth curves or surfaces that can be constructed by infinite subdivision of a polyline or polygon mesh of control points. New vertices are computed by linear combinations of the initial control points. We present a new non-linear subdivision scheme for the refine...

متن کامل

Subdivision Tree Representation of Arbitrary Triangle Meshes

We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary triangle mesh into a small set of normal meshes. The subdivision tree representation can be used to ...

متن کامل

Lossless Topological Subdivision of Triangle Meshes

In this paper, we investigate subdivision tree representations of arbitrary triangle meshes. By subdivision, we mean the recursive topological partitioning of a triangle into subtriangles. Such a process can be represented by a subdivision tree. We identify the class of regular triangle meshes, those that can be losslessly represented by a nontrivial subdivision tree, i.e. by a subdivision tree...

متن کامل

Reversing Subdivision Using Local Linear Conditions: Generating Multiresolutions on Regular Triangular Meshes

In a previous work [1] we investigated how to reverse subdivision rules using local linear conditions based upon least squares approximation. We outlined a general approach for reversing subdivisions and showed how to use the approach to construct multiresolutions with finite decomposition and reconstruction filters. These multiresolutions correspond to biorthogonal wavelet systems that use inn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001